By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 17, Issue 3, pp. 341-519

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Split-Perfect Graphs: Characterizations and Algorithmic Use

Andreas Brandstädt and Van Bang Le

pp. 341-360

BibTeX  Abstract Full Text:  PDF

Coloring the Maximal Cliques of Graphs

Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, and András Sebo

pp. 361-376

BibTeX  Abstract Full Text:  PDF

Number Theoretic Designs for Directed Regular Graphs of Small Diameter

William D. Banks, Alessandro Conflitti, and Igor E. Shparlinski

pp. 377-383

BibTeX  Abstract Full Text:  PDF

Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings

Christine T. Cheng

pp. 384-402

BibTeX  Abstract Full Text:  PDF

Graph Imperfection with a Co-Site Constraint

Stefanie Gerke and Colin McDiarmid

pp. 403-425

BibTeX  Abstract Full Text:  PDF

Error Exponents of Expander Codes under Linear-Complexity Decoding

Alexander Barg and Gilles Zémor

pp. 426-445

BibTeX  Abstract Full Text:  PDF

Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks

W. R. Chen, F. K. Hwang, and Xuding Zhu

pp. 446-452

BibTeX  Abstract Full Text:  PDF

Constraint Satisfaction Problems on Intervals and Lengths

Andrei Krokhin, Peter Jeavons, and Peter Jonsson

pp. 453-477

BibTeX  Abstract Full Text:  PDF

The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case

Randall Dougherty and Vance Faber

pp. 478-519

BibTeX  Abstract Full Text:  PDF